TrInc: Small Trusted Hardware for Large Distributed Systems

نویسندگان

  • Dave Levin
  • John R. Douceur
  • Jacob R. Lorch
  • Thomas Moscibroda
چکیده

A simple yet remarkably powerful tool of selfish and malicious participants in a distributed system is “equivocation”: making conflicting statements to others. We present TrInc, a small, trusted component that combats equivocation in large, distributed systems. Consisting fundamentally of only a non-decreasing counter and a key, TrInc provides a new primitive: unique, once-in-alifetime attestations. We show that TrInc is practical, versatile, and easily applicable to a wide range of distributed systems. Its deployment is viable because it is simple and because its fundamental components—a trusted counter and a key—are already deployed in many new personal computers today. We demonstrate TrInc’s versatility with three detailed case studies: attested append-only memory (A2M), PeerReview, and BitTorrent. We have implemented TrInc and our three case studies using real, currently available trusted hardware. Our evaluation shows that TrInc eliminates most of the trusted storage needed to implement A2M, significantly reduces communication overhead in PeerReview, and solves an open incentives issue in BitTorrent. Microbenchmarks of our TrInc implementation indicate directions for the design of future trusted hardware.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Nsdi '09: 6th Usenix Symposium on Networked Systems Design and Implementation Trust and Privac Y Trinc: Small Trusted Hardware for Large Distributed

Dave described how equivocation, making conflicting statements to others, is a very common and powerful tool for selfish and malicious users in distributed systems. It occurs in the Byzantine general’s problem, voting, and BitTorrent, where traditionally 3f+1 users are needed to tolerate f malicious users. By using trusted hardware, equivocation can be made impossible, and now only 2f+1 users a...

متن کامل

New Paradigms for Distributed Programming

The explosive growth of telecommunication networks is presenting distributed computing with new challenges. Distributed computing in-the-small as represented by LANs and small configurations of trusted machines cooperating towards a common goal have yielded to massively distributed computing systems where millions of untrusted computers running heterogeneous operating systems on top of varying ...

متن کامل

Chain of Trust: Can Trusted Hardware Help Scaling Blockchains?

As blockchain systems proliferate, there remains an unresolved scalability problem of their underlying distributed consensus protocols. Byzantine Fault Tolerance (BFT) consensus protocols offer high transaction throughput, but can only support small networks. Proof-of-Work (PoW) consensus protocol, on the other hand, can support thousands of nodes, but at the expense of poor transaction through...

متن کامل

Trusted Passages: Managing Distributed Trust to Meet the Needs of Emerging Applications

Proposed Work. The inherent complexity of applications, technologies, and platforms in today’s large scale distributed systems makes it extremely challenging for open systems to provide trustworthy services to end-users. In this research project, we propose an approach that integrates modern system virtualization techniques as well as new methods for runtime trust monitoring and assessment. Thi...

متن کامل

Trusted Computing, Trusted Third Parties, and Verified Communications

Trusted Computing gives rise to a new supply of trusted third parties on which distributed systems can potentially rely. They are the secure system components (hardware and software) built into nodes with Trusted Computing capabilities. These trusted third parties may be used for supporting communications in distributed systems. In particular, a trusted third party can check and certify the dat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009